<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html>
  <head>
    <meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
      <title>GTL - Graph Template Library: planar_embedding Class Reference</title>
      <link href="doxygen.css" rel="stylesheet" type="text/css">
  </head>
  <body>
    <p class="links">  
      <a href="../index.html">Home</a> |
      Documentation |
      <a href="../register.html">Download</a> |
      <a href="../platforms.html">Platforms</a> |
      <a href="../refer.html">Projects</a> |      
      <a href="../lists.html">Mailing Lists</a> |
      <a href="../history.html">Version History</a>
    </p>

<!-- Generated by Doxygen 1.5.3 -->
<div class="tabs">
  <ul>
    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
    <li class="current"><a href="classes.html"><span>Classes</span></a></li>
    <li><a href="files.html"><span>Files</span></a></li>
    <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
  </ul>
</div>
<div class="tabs">
  <ul>
    <li><a href="classes.html"><span>Alphabetical&nbsp;List</span></a></li>
    <li><a href="annotated.html"><span>Class&nbsp;List</span></a></li>
    <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
    <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
  </ul>
</div>
<h1>planar_embedding Class Reference</h1><!-- doxytag: class="planar_embedding" -->Ordered adjacency lists as a result of <a class="el" href="a00023.html" title="Tests if a graph can be drawn on a plane without any edge crossings.">planarity</a> testing.  
<a href="#_details">More...</a>
<p>
<div class="dynheader">
Collaboration diagram for planar_embedding:</div>
<div class="dynsection">
<p><center><img src="a00185.gif" border="0" usemap="#a00186" alt="Collaboration graph"></center>
<map name="a00186">
<area shape="rect" href="a00014.html" title="A directed or undirected graph." alt="" coords="44,7,100,31"><area shape="rect" title="G" alt="" coords="68,28,76,36"><area shape="rect" title="G" alt="" coords="68,93,76,101"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>

<p>
<a href="a00187.html">List of all members.</a><table border="0" cellpadding="0" cellspacing="0">
<tr><td></td></tr>
<tr><td colspan="2"><br><h2>Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00022.html#8c4e3b2bf05b82ffafa00932849dbd70">planar_embedding</a> (const <a class="el" href="a00022.html">planar_embedding</a> &amp;em)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00022.html#e5605eb5f21346f3f8194dd2db9de117">~planar_embedding</a> ()</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00022.html">planar_embedding</a> &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00022.html#01b3315f9d6fbb819e6125b029ad84ac">operator=</a> (const <a class="el" href="a00022.html">planar_embedding</a> &amp;em)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00027.html">adj_list</a> &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00022.html#151a1e7cf6cfbbd0a09c467ec8bc61d1">adjacency</a> (<a class="el" href="a00020.html">node</a> n)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">const <a class="el" href="a00027.html">adj_list</a> &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00022.html#cff04f2f8fdd718697ac4c92bab4aea0">adjacency</a> (<a class="el" href="a00020.html">node</a> n) const </td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00022.html#c0b41dd43adb80ed898b597e791230d8">adj_edges_begin</a> (<a class="el" href="a00020.html">node</a> n)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00022.html#1345ee93995019d81cc78fb2806acc88">adj_edges_end</a> (<a class="el" href="a00020.html">node</a> n)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00010.html">edge</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00022.html#4498733be831e1468044db038452efa4">cyclic_next</a> (<a class="el" href="a00020.html">node</a> n, <a class="el" href="a00010.html">edge</a> e)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00010.html">edge</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00022.html#e4d5e8226c1088c17e15ee6447133383">cyclic_prev</a> (<a class="el" href="a00020.html">node</a> n, <a class="el" href="a00010.html">edge</a> e)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00022.html#b2870ca51d0df44f8006ab69c3ee74d4">write_st</a> (ostream &amp;os, <a class="el" href="a00026.html">st_number</a> &amp;st)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">list&lt; <a class="el" href="a00010.html">edge</a> &gt; &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00022.html#b04859be18352bc53a120b0676a499ba">selfloops</a> ()</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">const list&lt; <a class="el" href="a00010.html">edge</a> &gt; &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00022.html#5bda41957054aed983245e28044f7eac">selfloops</a> () const </td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">list&lt; <a class="el" href="a00010.html">edge</a> &gt; &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00022.html#fb50ef8f3b5b2c6690b9d364db21f36f">multiple_edges</a> ()</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">const list&lt; <a class="el" href="a00010.html">edge</a> &gt; &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00022.html#47dedbda766cf0769f98e6ae63ef3152">multiple_edges</a> () const </td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">bool&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00022.html#6462d40327bf7c4c91523b888bb45cb3">check</a> ()</td></tr>

<tr><td colspan="2"><br><h2>Friends</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="b6a02224dbc06343d95919289aec77c8"></a><!-- doxytag: member="planar_embedding::planarity" ref="b6a02224dbc06343d95919289aec77c8" args="" -->
class&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00022.html#b6a02224dbc06343d95919289aec77c8">planarity</a></td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="0a5be4bb438c891059fae98f607f2a9c"></a><!-- doxytag: member="planar_embedding::pq_tree" ref="0a5be4bb438c891059fae98f607f2a9c" args="" -->
class&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00022.html#0a5be4bb438c891059fae98f607f2a9c">pq_tree</a></td></tr>

</table>
<hr><a name="_details"></a><h2>Detailed Description</h2>
Ordered adjacency lists as a result of <a class="el" href="a00023.html" title="Tests if a graph can be drawn on a plane without any edge crossings.">planarity</a> testing. 
<p>
It is known that if a <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> is planar the adjacency list of every <a class="el" href="a00020.html" title="A node in a graph.">node</a> can be ordered in such a way that it reflects the order the adjacent edges will have in a planar drawing around the <a class="el" href="a00020.html" title="A node in a graph.">node</a>. Although the tested <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> might have been directed the planar embedding one gets will always correspond to the underlying undirected <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>, i.e. an <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> from <code>n1</code> to <code>n2</code> will occurr in both adjacency lists. <hr><h2>Constructor &amp; Destructor Documentation</h2>
<a class="anchor" name="8c4e3b2bf05b82ffafa00932849dbd70"></a><!-- doxytag: member="planar_embedding::planar_embedding" ref="8c4e3b2bf05b82ffafa00932849dbd70" args="(const planar_embedding &amp;em)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">planar_embedding::planar_embedding           </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="a00022.html">planar_embedding</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>em</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Make this object a copy of <code>em</code>.<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>em</em>&nbsp;</td><td>planar embedding </td></tr>
  </table>
</dl>

</div>
</div><p>
<a class="anchor" name="e5605eb5f21346f3f8194dd2db9de117"></a><!-- doxytag: member="planar_embedding::~planar_embedding" ref="e5605eb5f21346f3f8194dd2db9de117" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">virtual planar_embedding::~planar_embedding           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [inline, virtual]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Destructor. 
</div>
</div><p>
<hr><h2>Member Function Documentation</h2>
<a class="anchor" name="01b3315f9d6fbb819e6125b029ad84ac"></a><!-- doxytag: member="planar_embedding::operator=" ref="01b3315f9d6fbb819e6125b029ad84ac" args="(const planar_embedding &amp;em)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00022.html">planar_embedding</a>&amp; planar_embedding::operator=           </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="a00022.html">planar_embedding</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>em</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Assigns <code>em</code> to this object. All former information in this object will be deleted.<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>em</em>&nbsp;</td><td></td></tr>
  </table>
</dl>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>reference to this object </dd></dl>

</div>
</div><p>
<a class="anchor" name="151a1e7cf6cfbbd0a09c467ec8bc61d1"></a><!-- doxytag: member="planar_embedding::adjacency" ref="151a1e7cf6cfbbd0a09c467ec8bc61d1" args="(node n)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00027.html">adj_list</a>&amp; planar_embedding::adjacency           </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="a00020.html">node</a>&nbsp;</td>
          <td class="paramname"> <em>n</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns reference to ordered adjacency list of <a class="el" href="a00020.html" title="A node in a graph.">node</a> <code>n</code>.<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>n</em>&nbsp;</td><td><a class="el" href="a00020.html" title="A node in a graph.">node</a></td></tr>
  </table>
</dl>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>ordered adjacency list </dd></dl>

</div>
</div><p>
<a class="anchor" name="cff04f2f8fdd718697ac4c92bab4aea0"></a><!-- doxytag: member="planar_embedding::adjacency" ref="cff04f2f8fdd718697ac4c92bab4aea0" args="(node n) const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">const <a class="el" href="a00027.html">adj_list</a>&amp; planar_embedding::adjacency           </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="a00020.html">node</a>&nbsp;</td>
          <td class="paramname"> <em>n</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const<code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns reference to ordered adjacency list of <a class="el" href="a00020.html" title="A node in a graph.">node</a> <code>n</code>.<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>n</em>&nbsp;</td><td><a class="el" href="a00020.html" title="A node in a graph.">node</a></td></tr>
  </table>
</dl>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>ordered adjacency list </dd></dl>

</div>
</div><p>
<a class="anchor" name="c0b41dd43adb80ed898b597e791230d8"></a><!-- doxytag: member="planar_embedding::adj_edges_begin" ref="c0b41dd43adb80ed898b597e791230d8" args="(node n)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">iterator planar_embedding::adj_edges_begin           </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="a00020.html">node</a>&nbsp;</td>
          <td class="paramname"> <em>n</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Start iteration through adjacency list of <a class="el" href="a00020.html" title="A node in a graph.">node</a> <code>n</code>.<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>n</em>&nbsp;</td><td><a class="el" href="a00020.html" title="A node in a graph.">node</a></td></tr>
  </table>
</dl>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>start iterator </dd></dl>

</div>
</div><p>
<a class="anchor" name="1345ee93995019d81cc78fb2806acc88"></a><!-- doxytag: member="planar_embedding::adj_edges_end" ref="1345ee93995019d81cc78fb2806acc88" args="(node n)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">iterator planar_embedding::adj_edges_end           </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="a00020.html">node</a>&nbsp;</td>
          <td class="paramname"> <em>n</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
End of iteration through adjacency list of <a class="el" href="a00020.html" title="A node in a graph.">node</a> <code>n</code>.<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>@p</em>&nbsp;</td><td>n <a class="el" href="a00020.html" title="A node in a graph.">node</a></td></tr>
  </table>
</dl>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>one-past the end iterator </dd></dl>

</div>
</div><p>
<a class="anchor" name="4498733be831e1468044db038452efa4"></a><!-- doxytag: member="planar_embedding::cyclic_next" ref="4498733be831e1468044db038452efa4" args="(node n, edge e)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00010.html">edge</a> planar_embedding::cyclic_next           </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="a00020.html">node</a>&nbsp;</td>
          <td class="paramname"> <em>n</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="a00010.html">edge</a>&nbsp;</td>
          <td class="paramname"> <em>e</em></td><td>&nbsp;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td><td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns the cyclic successor of <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> <code>e</code> in the adjacency list of <a class="el" href="a00020.html" title="A node in a graph.">node</a> <code>n</code>.<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>n</em>&nbsp;</td><td><a class="el" href="a00020.html" title="A node in a graph.">node</a> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>e</em>&nbsp;</td><td><a class="el" href="a00010.html" title="An edge in a graph.">edge</a> adjacent to <code>n</code> </td></tr>
  </table>
</dl>
<dl class="return" compact><dt><b>Returns:</b></dt><dd><a class="el" href="a00010.html" title="An edge in a graph.">edge</a> following <code>e</code> in adjacency of <code>n</code> </dd></dl>

</div>
</div><p>
<a class="anchor" name="e4d5e8226c1088c17e15ee6447133383"></a><!-- doxytag: member="planar_embedding::cyclic_prev" ref="e4d5e8226c1088c17e15ee6447133383" args="(node n, edge e)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00010.html">edge</a> planar_embedding::cyclic_prev           </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="a00020.html">node</a>&nbsp;</td>
          <td class="paramname"> <em>n</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="a00010.html">edge</a>&nbsp;</td>
          <td class="paramname"> <em>e</em></td><td>&nbsp;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td><td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns the cyclic predecessor of <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> <code>e</code> in the adjacency list of <a class="el" href="a00020.html" title="A node in a graph.">node</a> <code>n</code>.<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>n</em>&nbsp;</td><td><a class="el" href="a00020.html" title="A node in a graph.">node</a> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>e</em>&nbsp;</td><td><a class="el" href="a00010.html" title="An edge in a graph.">edge</a> adjacent to <code>n</code> </td></tr>
  </table>
</dl>
<dl class="return" compact><dt><b>Returns:</b></dt><dd><a class="el" href="a00010.html" title="An edge in a graph.">edge</a> preceding <code>e</code> in adjacency of <code>n</code> </dd></dl>

</div>
</div><p>
<a class="anchor" name="b2870ca51d0df44f8006ab69c3ee74d4"></a><!-- doxytag: member="planar_embedding::write_st" ref="b2870ca51d0df44f8006ab69c3ee74d4" args="(ostream &amp;os, st_number &amp;st)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void planar_embedding::write_st           </td>
          <td>(</td>
          <td class="paramtype">ostream &amp;&nbsp;</td>
          <td class="paramname"> <em>os</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="a00026.html">st_number</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>st</em></td><td>&nbsp;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td><td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Writes embedding with st-numbers as given by <code>st</code> to <code>os</code>.<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>os</em>&nbsp;</td><td>output stream</td></tr>
    <tr><td valign="top"></td><td valign="top"><em>st</em>&nbsp;</td><td>st-numbers </td></tr>
  </table>
</dl>

</div>
</div><p>
<a class="anchor" name="b04859be18352bc53a120b0676a499ba"></a><!-- doxytag: member="planar_embedding::selfloops" ref="b04859be18352bc53a120b0676a499ba" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">list&lt;<a class="el" href="a00010.html">edge</a>&gt;&amp; planar_embedding::selfloops           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns list of selfloops contained in the <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>. These will not occur in the adjacency lists.<p>
<dl compact><dt><b>Return values:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>list</em>&nbsp;</td><td>of selfloops </td></tr>
  </table>
</dl>

</div>
</div><p>
<a class="anchor" name="5bda41957054aed983245e28044f7eac"></a><!-- doxytag: member="planar_embedding::selfloops" ref="5bda41957054aed983245e28044f7eac" args="() const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">const list&lt;<a class="el" href="a00010.html">edge</a>&gt;&amp; planar_embedding::selfloops           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const<code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns list of selfloops contained in the <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>. These will not occur in the adjacency lists.<p>
<dl compact><dt><b>Return values:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>list</em>&nbsp;</td><td>of selfloops </td></tr>
  </table>
</dl>

</div>
</div><p>
<a class="anchor" name="fb50ef8f3b5b2c6690b9d364db21f36f"></a><!-- doxytag: member="planar_embedding::multiple_edges" ref="fb50ef8f3b5b2c6690b9d364db21f36f" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">list&lt;<a class="el" href="a00010.html">edge</a>&gt;&amp; planar_embedding::multiple_edges           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns list of multiple edges contained in the <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>. These are edges for which there is already another <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> connecting the same endpoints is contained in the adjacency lists. Please note that the notion "connecting" is meant in an undirected sense. These edges will not occur it the adjacency lists.<p>
<dl compact><dt><b>Return values:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>list</em>&nbsp;</td><td>of multiple edges </td></tr>
  </table>
</dl>

</div>
</div><p>
<a class="anchor" name="47dedbda766cf0769f98e6ae63ef3152"></a><!-- doxytag: member="planar_embedding::multiple_edges" ref="47dedbda766cf0769f98e6ae63ef3152" args="() const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">const list&lt;<a class="el" href="a00010.html">edge</a>&gt;&amp; planar_embedding::multiple_edges           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const<code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns list of multiple edges contained in the <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>. These are edges for which there is already another <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> connecting the same endpoints is contained in the adjacency lists. Please note that the notion "connecting" is meant in an undirected sense. These edges will not occur it the adjacency lists.<p>
<dl compact><dt><b>Return values:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>list</em>&nbsp;</td><td>of multiple edges </td></tr>
  </table>
</dl>

</div>
</div><p>
<a class="anchor" name="6462d40327bf7c4c91523b888bb45cb3"></a><!-- doxytag: member="planar_embedding::check" ref="6462d40327bf7c4c91523b888bb45cb3" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">bool planar_embedding::check           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Used for debugging only. Checks whether this is a correct planar embedding by checking the faces of the <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>, i.e. at any <a class="el" href="a00020.html" title="A node in a graph.">node</a> starting with an arbitrary adjacent <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> and advancing along <code>cyclic_next</code> the start <a class="el" href="a00020.html" title="A node in a graph.">node</a> must be met through the <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> given by <code>cyclic_prev</code> of the <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> we started with.<p>
<dl compact><dt><b>Return values:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>true</em>&nbsp;</td><td>iff embedding is correct </td></tr>
  </table>
</dl>

</div>
</div><p>
    <p class="links">
      <a href="http://www.uni-passau.de/">University of Passau</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/">FMI</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/fmi/lehrstuehle/brandenburg/">Theoretical
	Computer Science</a>
    </p>
  <div class="copyright">
      Design &copy; 2002, 2003 <a href="mailto:raitner@fmi.uni-passau.de">Marcus Raitner</a>,  University of Passau 
  </div>
</body>
</html>
